Shorter Addition-Subtraction Chain With Signed Composition Method
نویسندگان
چکیده
منابع مشابه
Finding Shorter Addition/Subtraction-Chains
Small Finding a shorter addition/subtraction-chain for an integer is an important problem for many cryptographic systems based on number theory. Especially, execution time of multiplication on an elliptic curve cryptosystem is directly proportional to the length of the addition/subtraction-chain. In this paper, we propose an algorithm to find an addition/subtractionchain. The proposed algorithm...
متن کاملExpansion of Sliding Window Method for Finding Shorter Addition/Subtraction-Chains
Finding a shorter addition/subtraction-chain for an integer is an important problem for many cryptographic systems based on number theory. Especially, execution time of multiplication on an elliptic curve cryptosystem is directly proportional to the length of the addition/subtraction-chain. In this paper, we propose an algorithm to find an addition/subtraction-chain. The proposed algorithm is b...
متن کاملPerformance-Improved Computation of Very Large Word-Length LNS Addition/Subtraction Using Signed-Digit Arithmetic
Pipelined computation of very large word-length logarithmic number system (LNS) addition/subtraction requires a lot of hardware and long pipeline latency. This paper proposes a base-e exponential algorithm to simplify the exponential computation and to replace half of the pipeline stages by multiplication-and-accumulate operations. By using this approach, the circuit area and the pipeline laten...
متن کاملSigned Binary Addition Circuitry with Inherent Even Parity Outputs
A signed binary (SB) addition circuit is presented that always produces an even parity representation of the sum word. The novelty of this design is that no extra check bits are generated or used. The redundancy inherent in a SB representation is further exploited to contain parity information.
متن کاملSigned Digit Addition and Related Operations with Threshold Logic
ÐAssuming signed digit number representations, we investigate the implementation of some addition related operations assuming linear threshold networks. We measure the depth and size of the networks in terms of linear threshold gates. We show first that a depth-2 network with O n size, weight, and fan-in complexities can perform signed digit symmetric functions. Consequently, assuming radix-2 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Engineering and Technology
سال: 2017
ISSN: 2319-8613,0975-4024
DOI: 10.21817/ijet/2017/v9i1/170902306